Cosa (chi) è eager evaluation - definizione

STRATEGY USED BY PROGRAMMING LANGUAGES TO DETERMINE TWO THINGS—WHEN TO EVALUATE THE ARGUMENTS OF A FUNCTION CALL AND WHAT KIND OF VALUE TO PASS TO THE FUNCTION

Eager evaluation; Call-by-something; Call by reference; Call By Reference; Call by value; Call by something; Call by name; Strict evaluation; Cbpv; Call-by-name; Call-by-need; Call-by-value; Call-by-result; Call-by-reference; Call by result; Call-by-value-result; Call by Name; Pass-by-reference; Return-by-reference; Comparison of normal-order evaluation and applicative-order evaluation; Applicative-order evaluation; Normal-order evaluation; Applicative order; Applicative order evaluation; Normal order evaluation; Non-strict evaluation; Pass by reference; Pass-by-value; Non-strict semantics; Eager execution; Lazy language; Avaliação ansiosa; Avaliacao ansiosa; Call by value-result; Call by value result; Call by value/result; Pass by value; Pass By Value; Pass-By-Value; Pass By Reference; Pass-By-Reference; Pass By Name; Pass-By-Name; Pass-By-Value Evaluation; Pass-By-Reference Evaluation; Pass-By-Name Evaluation; Call-By-Value Evaluation; Call-By-Reference Evaluation; All-By-Name Evaluation; Normal order reduction; Call by object; Call-by-object; Called by value; Call by sharing; Call by future; Call-by-sharing; Call by copy-restore; Call by address; Call by macro expansion; Greedy evaluation

eager evaluation

Any evaluation strategy where evaluation of some or all function arguments is started before their value is required. A typical example is call-by-value, where all arguments are passed evaluated. The opposite of eager evaluation is call-by-need where evaluation of an argument is only started when it is required. The term "speculative evaluation" is very close in meaning to eager evaluation but is applied mostly to parallel architectures whereas eager evaluation is used of both sequential and parallel evaluators. Eager evaluation does not specify exactly when argument evaluation takes place - it might be done fully speculatively (all redexes in the program reduced in parallel) or may be done by the caller just before the function is entered. The term "eager evaluation" was invented by Carl Hewitt and Henry Baker <hbaker@netcom.com> and used in their paper ["The Incremental Garbage Collection of Processes", Sigplan Notices, Aug 1977. ftp://ftp.netcom.com/pub/hb/hbaker/Futures.html]. It was named after their "eager beaver" evaluator. See also conservative evaluation, lenient evaluation, strict evaluation. (1994-12-22)

Edward Eager

AMERICAN CHILDREN'S AND THEATRICAL WRITER (1911-1964)

Eager, Edward; Knight's Castle

Edward McMaken Eager (June 20, 1911 – October 23, 1964) was an American lyricist, dramatist, and writer of children's fiction. His children's novels feature the appearance of magic in the lives of ordinary children.

https://en.wikipedia.org/wiki/Edward_Eager

Evaluation function

FUNCTION RETURNING ESTIMATED VALUE OF A POSITION IN A GAME PLAYING PROGRAM

Static evaluation function; Heuristic evaluation function; Piece-square table

An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position (usually at a leaf or terminal node) in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.

https://en.wikipedia.org/wiki/Evaluation_function

Wikipedia

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

To illustrate, executing a function call f(a,b) may first evaluate the arguments a and b, store the results in references or memory locations ref_a and ref_b, then evaluate the function's body with those references passed in. This gives the function the ability to look up the argument values, to modify them via assignment as if they were local variables, and to return values via the references. This is the call-by-reference evaluation strategy.

Evaluation strategy is part of the semantics of the programming language definition. Some languages, such as PureScript, have variants with different evaluation strategies. Some declarative languages, such as Datalog, support multiple evaluation strategies. Some languages define a calling convention.

https://en.wikipedia.org/wiki/Evaluation strategy